Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  1to3vfriswmgra Structured version   Visualization version   GIF version

Theorem 1to3vfriswmgra 26534
 Description: Every friendship graph with one, two or three vertices is a windmill graph. (Contributed by Alexander van der Vekens, 6-Oct-2017.)
Assertion
Ref Expression
1to3vfriswmgra ((𝐴𝑋 ∧ (𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵} ∨ 𝑉 = {𝐴, 𝐵, 𝐶})) → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))
Distinct variable groups:   𝐴,,𝑣,𝑤   𝐵,,𝑣,𝑤   𝐶,,𝑣,𝑤   ,𝐸,𝑣,𝑤   ,𝑉,𝑣,𝑤   𝑣,𝑋,𝑤
Allowed substitution hint:   𝑋()

Proof of Theorem 1to3vfriswmgra
StepHypRef Expression
1 df-3or 1032 . . 3 ((𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵} ∨ 𝑉 = {𝐴, 𝐵, 𝐶}) ↔ ((𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵}) ∨ 𝑉 = {𝐴, 𝐵, 𝐶}))
2 1to2vfriswmgra 26533 . . . . 5 ((𝐴𝑋 ∧ (𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵})) → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))
32expcom 450 . . . 4 ((𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵}) → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))
4 tppreq3 4238 . . . . . . 7 (𝐵 = 𝐶 → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐵})
54eqeq2d 2620 . . . . . 6 (𝐵 = 𝐶 → (𝑉 = {𝐴, 𝐵, 𝐶} ↔ 𝑉 = {𝐴, 𝐵}))
6 olc 398 . . . . . . . . . 10 (𝑉 = {𝐴, 𝐵} → (𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵}))
76anim1i 590 . . . . . . . . 9 ((𝑉 = {𝐴, 𝐵} ∧ 𝐴𝑋) → ((𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵}) ∧ 𝐴𝑋))
87ancomd 466 . . . . . . . 8 ((𝑉 = {𝐴, 𝐵} ∧ 𝐴𝑋) → (𝐴𝑋 ∧ (𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵})))
98, 2syl 17 . . . . . . 7 ((𝑉 = {𝐴, 𝐵} ∧ 𝐴𝑋) → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))
109ex 449 . . . . . 6 (𝑉 = {𝐴, 𝐵} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))
115, 10syl6bi 242 . . . . 5 (𝐵 = 𝐶 → (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))))
12 tpprceq3 4276 . . . . . . . 8 (¬ (𝐵 ∈ V ∧ 𝐵𝐴) → {𝐶, 𝐴, 𝐵} = {𝐶, 𝐴})
13 tprot 4228 . . . . . . . . . . . . 13 {𝐶, 𝐴, 𝐵} = {𝐴, 𝐵, 𝐶}
1413eqeq1i 2615 . . . . . . . . . . . 12 ({𝐶, 𝐴, 𝐵} = {𝐶, 𝐴} ↔ {𝐴, 𝐵, 𝐶} = {𝐶, 𝐴})
1514biimpi 205 . . . . . . . . . . 11 ({𝐶, 𝐴, 𝐵} = {𝐶, 𝐴} → {𝐴, 𝐵, 𝐶} = {𝐶, 𝐴})
16 prcom 4211 . . . . . . . . . . 11 {𝐶, 𝐴} = {𝐴, 𝐶}
1715, 16syl6eq 2660 . . . . . . . . . 10 ({𝐶, 𝐴, 𝐵} = {𝐶, 𝐴} → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐶})
1817eqeq2d 2620 . . . . . . . . 9 ({𝐶, 𝐴, 𝐵} = {𝐶, 𝐴} → (𝑉 = {𝐴, 𝐵, 𝐶} ↔ 𝑉 = {𝐴, 𝐶}))
19 olc 398 . . . . . . . . . . 11 (𝑉 = {𝐴, 𝐶} → (𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐶}))
20 1to2vfriswmgra 26533 . . . . . . . . . . 11 ((𝐴𝑋 ∧ (𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐶})) → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))
2119, 20sylan2 490 . . . . . . . . . 10 ((𝐴𝑋𝑉 = {𝐴, 𝐶}) → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))
2221expcom 450 . . . . . . . . 9 (𝑉 = {𝐴, 𝐶} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))
2318, 22syl6bi 242 . . . . . . . 8 ({𝐶, 𝐴, 𝐵} = {𝐶, 𝐴} → (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))))
2412, 23syl 17 . . . . . . 7 (¬ (𝐵 ∈ V ∧ 𝐵𝐴) → (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))))
2524a1d 25 . . . . . 6 (¬ (𝐵 ∈ V ∧ 𝐵𝐴) → (𝐵𝐶 → (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))))
26 tpprceq3 4276 . . . . . . . 8 (¬ (𝐶 ∈ V ∧ 𝐶𝐴) → {𝐵, 𝐴, 𝐶} = {𝐵, 𝐴})
27 tpcoma 4229 . . . . . . . . . . . . 13 {𝐵, 𝐴, 𝐶} = {𝐴, 𝐵, 𝐶}
2827eqeq1i 2615 . . . . . . . . . . . 12 ({𝐵, 𝐴, 𝐶} = {𝐵, 𝐴} ↔ {𝐴, 𝐵, 𝐶} = {𝐵, 𝐴})
2928biimpi 205 . . . . . . . . . . 11 ({𝐵, 𝐴, 𝐶} = {𝐵, 𝐴} → {𝐴, 𝐵, 𝐶} = {𝐵, 𝐴})
30 prcom 4211 . . . . . . . . . . 11 {𝐵, 𝐴} = {𝐴, 𝐵}
3129, 30syl6eq 2660 . . . . . . . . . 10 ({𝐵, 𝐴, 𝐶} = {𝐵, 𝐴} → {𝐴, 𝐵, 𝐶} = {𝐴, 𝐵})
3231eqeq2d 2620 . . . . . . . . 9 ({𝐵, 𝐴, 𝐶} = {𝐵, 𝐴} → (𝑉 = {𝐴, 𝐵, 𝐶} ↔ 𝑉 = {𝐴, 𝐵}))
336, 2sylan2 490 . . . . . . . . . . 11 ((𝐴𝑋𝑉 = {𝐴, 𝐵}) → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))
3433expcom 450 . . . . . . . . . 10 (𝑉 = {𝐴, 𝐵} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))
3534a1d 25 . . . . . . . . 9 (𝑉 = {𝐴, 𝐵} → (𝐵𝐶 → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))))
3632, 35syl6bi 242 . . . . . . . 8 ({𝐵, 𝐴, 𝐶} = {𝐵, 𝐴} → (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐵𝐶 → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))))
3726, 36syl 17 . . . . . . 7 (¬ (𝐶 ∈ V ∧ 𝐶𝐴) → (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐵𝐶 → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))))
3837com23 84 . . . . . 6 (¬ (𝐶 ∈ V ∧ 𝐶𝐴) → (𝐵𝐶 → (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))))
39 simpl 472 . . . . . . . . . . . . 13 ((𝐵 ∈ V ∧ 𝐵𝐴) → 𝐵 ∈ V)
40 simpl 472 . . . . . . . . . . . . 13 ((𝐶 ∈ V ∧ 𝐶𝐴) → 𝐶 ∈ V)
4139, 40anim12i 588 . . . . . . . . . . . 12 (((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) → (𝐵 ∈ V ∧ 𝐶 ∈ V))
4241ad2antrr 758 . . . . . . . . . . 11 (((((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) ∧ 𝐵𝐶) ∧ 𝑉 = {𝐴, 𝐵, 𝐶}) → (𝐵 ∈ V ∧ 𝐶 ∈ V))
4342anim1i 590 . . . . . . . . . 10 ((((((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) ∧ 𝐵𝐶) ∧ 𝑉 = {𝐴, 𝐵, 𝐶}) ∧ 𝐴𝑋) → ((𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ 𝐴𝑋))
4443ancomd 466 . . . . . . . . 9 ((((((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) ∧ 𝐵𝐶) ∧ 𝑉 = {𝐴, 𝐵, 𝐶}) ∧ 𝐴𝑋) → (𝐴𝑋 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)))
45 3anass 1035 . . . . . . . . 9 ((𝐴𝑋𝐵 ∈ V ∧ 𝐶 ∈ V) ↔ (𝐴𝑋 ∧ (𝐵 ∈ V ∧ 𝐶 ∈ V)))
4644, 45sylibr 223 . . . . . . . 8 ((((((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) ∧ 𝐵𝐶) ∧ 𝑉 = {𝐴, 𝐵, 𝐶}) ∧ 𝐴𝑋) → (𝐴𝑋𝐵 ∈ V ∧ 𝐶 ∈ V))
47 simpr 476 . . . . . . . . . . . . 13 ((𝐵 ∈ V ∧ 𝐵𝐴) → 𝐵𝐴)
4847necomd 2837 . . . . . . . . . . . 12 ((𝐵 ∈ V ∧ 𝐵𝐴) → 𝐴𝐵)
49 simpr 476 . . . . . . . . . . . . 13 ((𝐶 ∈ V ∧ 𝐶𝐴) → 𝐶𝐴)
5049necomd 2837 . . . . . . . . . . . 12 ((𝐶 ∈ V ∧ 𝐶𝐴) → 𝐴𝐶)
5148, 50anim12i 588 . . . . . . . . . . 11 (((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) → (𝐴𝐵𝐴𝐶))
5251anim1i 590 . . . . . . . . . 10 ((((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) ∧ 𝐵𝐶) → ((𝐴𝐵𝐴𝐶) ∧ 𝐵𝐶))
53 df-3an 1033 . . . . . . . . . 10 ((𝐴𝐵𝐴𝐶𝐵𝐶) ↔ ((𝐴𝐵𝐴𝐶) ∧ 𝐵𝐶))
5452, 53sylibr 223 . . . . . . . . 9 ((((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) ∧ 𝐵𝐶) → (𝐴𝐵𝐴𝐶𝐵𝐶))
5554ad2antrr 758 . . . . . . . 8 ((((((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) ∧ 𝐵𝐶) ∧ 𝑉 = {𝐴, 𝐵, 𝐶}) ∧ 𝐴𝑋) → (𝐴𝐵𝐴𝐶𝐵𝐶))
56 simplr 788 . . . . . . . 8 ((((((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) ∧ 𝐵𝐶) ∧ 𝑉 = {𝐴, 𝐵, 𝐶}) ∧ 𝐴𝑋) → 𝑉 = {𝐴, 𝐵, 𝐶})
57 3vfriswmgra 26532 . . . . . . . 8 (((𝐴𝑋𝐵 ∈ V ∧ 𝐶 ∈ V) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶) ∧ 𝑉 = {𝐴, 𝐵, 𝐶}) → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))
5846, 55, 56, 57syl3anc 1318 . . . . . . 7 ((((((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) ∧ 𝐵𝐶) ∧ 𝑉 = {𝐴, 𝐵, 𝐶}) ∧ 𝐴𝑋) → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))
5958exp41 636 . . . . . 6 (((𝐵 ∈ V ∧ 𝐵𝐴) ∧ (𝐶 ∈ V ∧ 𝐶𝐴)) → (𝐵𝐶 → (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))))
6025, 38, 59ecase 980 . . . . 5 (𝐵𝐶 → (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))))
6111, 60pm2.61ine 2865 . . . 4 (𝑉 = {𝐴, 𝐵, 𝐶} → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))
623, 61jaoi 393 . . 3 (((𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵}) ∨ 𝑉 = {𝐴, 𝐵, 𝐶}) → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))
631, 62sylbi 206 . 2 ((𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵} ∨ 𝑉 = {𝐴, 𝐵, 𝐶}) → (𝐴𝑋 → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸))))
6463impcom 445 1 ((𝐴𝑋 ∧ (𝑉 = {𝐴} ∨ 𝑉 = {𝐴, 𝐵} ∨ 𝑉 = {𝐴, 𝐵, 𝐶})) → (𝑉 FriendGrph 𝐸 → ∃𝑉𝑣 ∈ (𝑉 ∖ {})({𝑣, } ∈ ran 𝐸 ∧ ∃!𝑤 ∈ (𝑉 ∖ {}){𝑣, 𝑤} ∈ ran 𝐸)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∨ wo 382   ∧ wa 383   ∨ w3o 1030   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  ∃wrex 2897  ∃!wreu 2898  Vcvv 3173   ∖ cdif 3537  {csn 4125  {cpr 4127  {ctp 4129   class class class wbr 4583  ran crn 5039   FriendGrph cfrgra 26515 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-hash 12980  df-usgra 25862  df-frgra 26516 This theorem is referenced by:  1to3vfriendship  26535
 Copyright terms: Public domain W3C validator