Metamath Proof Explorer


Theorem dfoi

Description: Rewrite df-oi with abbreviations. (Contributed by Mario Carneiro, 24-Jun-2015)

Ref Expression
Hypotheses dfoi.1 𝐶 = { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 }
dfoi.2 𝐺 = ( ∈ V ↦ ( 𝑣𝐶𝑢𝐶 ¬ 𝑢 𝑅 𝑣 ) )
dfoi.3 𝐹 = recs ( 𝐺 )
Assertion dfoi OrdIso ( 𝑅 , 𝐴 ) = if ( ( 𝑅 We 𝐴𝑅 Se 𝐴 ) , ( 𝐹 ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( 𝐹𝑥 ) 𝑧 𝑅 𝑡 } ) , ∅ )

Proof

Step Hyp Ref Expression
1 dfoi.1 𝐶 = { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 }
2 dfoi.2 𝐺 = ( ∈ V ↦ ( 𝑣𝐶𝑢𝐶 ¬ 𝑢 𝑅 𝑣 ) )
3 dfoi.3 𝐹 = recs ( 𝐺 )
4 df-oi OrdIso ( 𝑅 , 𝐴 ) = if ( ( 𝑅 We 𝐴𝑅 Se 𝐴 ) , ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) “ 𝑥 ) 𝑧 𝑅 𝑡 } ) , ∅ )
5 1 a1i ( ∈ V → 𝐶 = { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } )
6 5 raleqdv ( ∈ V → ( ∀ 𝑢𝐶 ¬ 𝑢 𝑅 𝑣 ↔ ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) )
7 5 6 riotaeqbidv ( ∈ V → ( 𝑣𝐶𝑢𝐶 ¬ 𝑢 𝑅 𝑣 ) = ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) )
8 7 mpteq2ia ( ∈ V ↦ ( 𝑣𝐶𝑢𝐶 ¬ 𝑢 𝑅 𝑣 ) ) = ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) )
9 2 8 eqtri 𝐺 = ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) )
10 recseq ( 𝐺 = ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) → recs ( 𝐺 ) = recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) )
11 9 10 ax-mp recs ( 𝐺 ) = recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) )
12 3 11 eqtri 𝐹 = recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) )
13 12 imaeq1i ( 𝐹𝑥 ) = ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) “ 𝑥 )
14 13 raleqi ( ∀ 𝑧 ∈ ( 𝐹𝑥 ) 𝑧 𝑅 𝑡 ↔ ∀ 𝑧 ∈ ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) “ 𝑥 ) 𝑧 𝑅 𝑡 )
15 14 rexbii ( ∃ 𝑡𝐴𝑧 ∈ ( 𝐹𝑥 ) 𝑧 𝑅 𝑡 ↔ ∃ 𝑡𝐴𝑧 ∈ ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) “ 𝑥 ) 𝑧 𝑅 𝑡 )
16 15 rabbii { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( 𝐹𝑥 ) 𝑧 𝑅 𝑡 } = { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) “ 𝑥 ) 𝑧 𝑅 𝑡 }
17 12 16 reseq12i ( 𝐹 ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( 𝐹𝑥 ) 𝑧 𝑅 𝑡 } ) = ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) “ 𝑥 ) 𝑧 𝑅 𝑡 } )
18 ifeq1 ( ( 𝐹 ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( 𝐹𝑥 ) 𝑧 𝑅 𝑡 } ) = ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) “ 𝑥 ) 𝑧 𝑅 𝑡 } ) → if ( ( 𝑅 We 𝐴𝑅 Se 𝐴 ) , ( 𝐹 ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( 𝐹𝑥 ) 𝑧 𝑅 𝑡 } ) , ∅ ) = if ( ( 𝑅 We 𝐴𝑅 Se 𝐴 ) , ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) “ 𝑥 ) 𝑧 𝑅 𝑡 } ) , ∅ ) )
19 17 18 ax-mp if ( ( 𝑅 We 𝐴𝑅 Se 𝐴 ) , ( 𝐹 ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( 𝐹𝑥 ) 𝑧 𝑅 𝑡 } ) , ∅ ) = if ( ( 𝑅 We 𝐴𝑅 Se 𝐴 ) , ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( recs ( ( ∈ V ↦ ( 𝑣 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ∀ 𝑢 ∈ { 𝑤𝐴 ∣ ∀ 𝑗 ∈ ran 𝑗 𝑅 𝑤 } ¬ 𝑢 𝑅 𝑣 ) ) ) “ 𝑥 ) 𝑧 𝑅 𝑡 } ) , ∅ )
20 4 19 eqtr4i OrdIso ( 𝑅 , 𝐴 ) = if ( ( 𝑅 We 𝐴𝑅 Se 𝐴 ) , ( 𝐹 ↾ { 𝑥 ∈ On ∣ ∃ 𝑡𝐴𝑧 ∈ ( 𝐹𝑥 ) 𝑧 𝑅 𝑡 } ) , ∅ )