Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  uspgrsprfo Structured version   Visualization version   GIF version

Theorem uspgrsprfo 48069
Description: The mapping 𝐹 is a function from the "simple pseudographs" with a fixed set of vertices 𝑉 onto the subsets of the set of pairs over the set 𝑉. (Contributed by AV, 25-Nov-2021.)
Hypotheses
Ref Expression
uspgrsprf.p 𝑃 = 𝒫 (Pairs‘𝑉)
uspgrsprf.g 𝐺 = {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))}
uspgrsprf.f 𝐹 = (𝑔𝐺 ↦ (2nd𝑔))
Assertion
Ref Expression
uspgrsprfo (𝑉𝑊𝐹:𝐺onto𝑃)
Distinct variable groups:   𝑃,𝑒,𝑞,𝑣   𝑒,𝑉,𝑞,𝑣   𝑒,𝑊,𝑣   𝑔,𝐺   𝑃,𝑔,𝑒,𝑣   𝑊,𝑞
Allowed substitution hints:   𝐹(𝑣,𝑒,𝑔,𝑞)   𝐺(𝑣,𝑒,𝑞)   𝑉(𝑔)   𝑊(𝑔)

Proof of Theorem uspgrsprfo
Dummy variables 𝑎 𝑏 𝑓 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uspgrsprf.p . . . 4 𝑃 = 𝒫 (Pairs‘𝑉)
2 uspgrsprf.g . . . 4 𝐺 = {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))}
3 uspgrsprf.f . . . 4 𝐹 = (𝑔𝐺 ↦ (2nd𝑔))
41, 2, 3uspgrsprf 48067 . . 3 𝐹:𝐺𝑃
54a1i 11 . 2 (𝑉𝑊𝐹:𝐺𝑃)
61eleq2i 2832 . . . . . . 7 (𝑎𝑃𝑎 ∈ 𝒫 (Pairs‘𝑉))
7 velpw 4604 . . . . . . 7 (𝑎 ∈ 𝒫 (Pairs‘𝑉) ↔ 𝑎 ⊆ (Pairs‘𝑉))
86, 7bitri 275 . . . . . 6 (𝑎𝑃𝑎 ⊆ (Pairs‘𝑉))
9 eqidd 2737 . . . . . . . . . 10 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → 𝑉 = 𝑉)
10 vex 3483 . . . . . . . . . . . . . . 15 𝑎 ∈ V
1110a1i 11 . . . . . . . . . . . . . 14 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → 𝑎 ∈ V)
12 f1oi 6885 . . . . . . . . . . . . . . . . 17 ( I ↾ 𝑎):𝑎1-1-onto𝑎
1312a1i 11 . . . . . . . . . . . . . . . 16 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → ( I ↾ 𝑎):𝑎1-1-onto𝑎)
14 dmresi 6069 . . . . . . . . . . . . . . . . 17 dom ( I ↾ 𝑎) = 𝑎
15 f1oeq2 6836 . . . . . . . . . . . . . . . . 17 (dom ( I ↾ 𝑎) = 𝑎 → (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑎 ↔ ( I ↾ 𝑎):𝑎1-1-onto𝑎))
1614, 15ax-mp 5 . . . . . . . . . . . . . . . 16 (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑎 ↔ ( I ↾ 𝑎):𝑎1-1-onto𝑎)
1713, 16sylibr 234 . . . . . . . . . . . . . . 15 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑎)
18 sprvalpwle2 47481 . . . . . . . . . . . . . . . . 17 (𝑉𝑊 → (Pairs‘𝑉) = {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
1918sseq2d 4015 . . . . . . . . . . . . . . . 16 (𝑉𝑊 → (𝑎 ⊆ (Pairs‘𝑉) ↔ 𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
2019biimpac 478 . . . . . . . . . . . . . . 15 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → 𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
2117, 20jca 511 . . . . . . . . . . . . . 14 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑎𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
22 f1oeq3 6837 . . . . . . . . . . . . . . 15 (𝑓 = 𝑎 → (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑓 ↔ ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑎))
23 sseq1 4008 . . . . . . . . . . . . . . 15 (𝑓 = 𝑎 → (𝑓 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ 𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
2422, 23anbi12d 632 . . . . . . . . . . . . . 14 (𝑓 = 𝑎 → ((( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑓𝑓 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}) ↔ (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑎𝑎 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})))
2511, 21, 24spcedv 3597 . . . . . . . . . . . . 13 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → ∃𝑓(( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑓𝑓 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
26 resiexg 7935 . . . . . . . . . . . . . . 15 (𝑎 ∈ V → ( I ↾ 𝑎) ∈ V)
2710, 26ax-mp 5 . . . . . . . . . . . . . 14 ( I ↾ 𝑎) ∈ V
2827f11o 7972 . . . . . . . . . . . . 13 (( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1→{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2} ↔ ∃𝑓(( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1-onto𝑓𝑓 ⊆ {𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
2925, 28sylibr 234 . . . . . . . . . . . 12 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1→{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2})
3010a1i 11 . . . . . . . . . . . . . . 15 (𝑎 ⊆ (Pairs‘𝑉) → 𝑎 ∈ V)
3130resiexd 7237 . . . . . . . . . . . . . 14 (𝑎 ⊆ (Pairs‘𝑉) → ( I ↾ 𝑎) ∈ V)
3231anim1ci 616 . . . . . . . . . . . . 13 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → (𝑉𝑊 ∧ ( I ↾ 𝑎) ∈ V))
33 isuspgrop 29179 . . . . . . . . . . . . 13 ((𝑉𝑊 ∧ ( I ↾ 𝑎) ∈ V) → (⟨𝑉, ( I ↾ 𝑎)⟩ ∈ USPGraph ↔ ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1→{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
3432, 33syl 17 . . . . . . . . . . . 12 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → (⟨𝑉, ( I ↾ 𝑎)⟩ ∈ USPGraph ↔ ( I ↾ 𝑎):dom ( I ↾ 𝑎)–1-1→{𝑝 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (♯‘𝑝) ≤ 2}))
3529, 34mpbird 257 . . . . . . . . . . 11 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → ⟨𝑉, ( I ↾ 𝑎)⟩ ∈ USPGraph)
36 fveqeq2 6914 . . . . . . . . . . . . 13 (𝑞 = ⟨𝑉, ( I ↾ 𝑎)⟩ → ((Vtx‘𝑞) = 𝑉 ↔ (Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉))
37 fveqeq2 6914 . . . . . . . . . . . . 13 (𝑞 = ⟨𝑉, ( I ↾ 𝑎)⟩ → ((Edg‘𝑞) = 𝑎 ↔ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎))
3836, 37anbi12d 632 . . . . . . . . . . . 12 (𝑞 = ⟨𝑉, ( I ↾ 𝑎)⟩ → (((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎) ↔ ((Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉 ∧ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎)))
3938adantl 481 . . . . . . . . . . 11 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) ∧ 𝑞 = ⟨𝑉, ( I ↾ 𝑎)⟩) → (((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎) ↔ ((Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉 ∧ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎)))
40 opvtxfv 29022 . . . . . . . . . . . . . 14 ((𝑉𝑊 ∧ ( I ↾ 𝑎) ∈ V) → (Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉)
4131, 40sylan2 593 . . . . . . . . . . . . 13 ((𝑉𝑊𝑎 ⊆ (Pairs‘𝑉)) → (Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉)
42 edgopval 29069 . . . . . . . . . . . . . . 15 ((𝑉𝑊 ∧ ( I ↾ 𝑎) ∈ V) → (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = ran ( I ↾ 𝑎))
4331, 42sylan2 593 . . . . . . . . . . . . . 14 ((𝑉𝑊𝑎 ⊆ (Pairs‘𝑉)) → (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = ran ( I ↾ 𝑎))
44 rnresi 6092 . . . . . . . . . . . . . 14 ran ( I ↾ 𝑎) = 𝑎
4543, 44eqtrdi 2792 . . . . . . . . . . . . 13 ((𝑉𝑊𝑎 ⊆ (Pairs‘𝑉)) → (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎)
4641, 45jca 511 . . . . . . . . . . . 12 ((𝑉𝑊𝑎 ⊆ (Pairs‘𝑉)) → ((Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉 ∧ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎))
4746ancoms 458 . . . . . . . . . . 11 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → ((Vtx‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑉 ∧ (Edg‘⟨𝑉, ( I ↾ 𝑎)⟩) = 𝑎))
4835, 39, 47rspcedvd 3623 . . . . . . . . . 10 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))
499, 48jca 511 . . . . . . . . 9 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎)))
502eleq2i 2832 . . . . . . . . . 10 (⟨𝑉, 𝑎⟩ ∈ 𝐺 ↔ ⟨𝑉, 𝑎⟩ ∈ {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))})
5130anim1ci 616 . . . . . . . . . . 11 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → (𝑉𝑊𝑎 ∈ V))
52 eqeq1 2740 . . . . . . . . . . . . . 14 (𝑣 = 𝑉 → (𝑣 = 𝑉𝑉 = 𝑉))
5352adantr 480 . . . . . . . . . . . . 13 ((𝑣 = 𝑉𝑒 = 𝑎) → (𝑣 = 𝑉𝑉 = 𝑉))
54 eqeq2 2748 . . . . . . . . . . . . . . 15 (𝑣 = 𝑉 → ((Vtx‘𝑞) = 𝑣 ↔ (Vtx‘𝑞) = 𝑉))
55 eqeq2 2748 . . . . . . . . . . . . . . 15 (𝑒 = 𝑎 → ((Edg‘𝑞) = 𝑒 ↔ (Edg‘𝑞) = 𝑎))
5654, 55bi2anan9 638 . . . . . . . . . . . . . 14 ((𝑣 = 𝑉𝑒 = 𝑎) → (((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒) ↔ ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎)))
5756rexbidv 3178 . . . . . . . . . . . . 13 ((𝑣 = 𝑉𝑒 = 𝑎) → (∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒) ↔ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎)))
5853, 57anbi12d 632 . . . . . . . . . . . 12 ((𝑣 = 𝑉𝑒 = 𝑎) → ((𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒)) ↔ (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))))
5958opelopabga 5537 . . . . . . . . . . 11 ((𝑉𝑊𝑎 ∈ V) → (⟨𝑉, 𝑎⟩ ∈ {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))} ↔ (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))))
6051, 59syl 17 . . . . . . . . . 10 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → (⟨𝑉, 𝑎⟩ ∈ {⟨𝑣, 𝑒⟩ ∣ (𝑣 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑣 ∧ (Edg‘𝑞) = 𝑒))} ↔ (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))))
6150, 60bitrid 283 . . . . . . . . 9 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → (⟨𝑉, 𝑎⟩ ∈ 𝐺 ↔ (𝑉 = 𝑉 ∧ ∃𝑞 ∈ USPGraph ((Vtx‘𝑞) = 𝑉 ∧ (Edg‘𝑞) = 𝑎))))
6249, 61mpbird 257 . . . . . . . 8 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → ⟨𝑉, 𝑎⟩ ∈ 𝐺)
63 fveq2 6905 . . . . . . . . . 10 (𝑏 = ⟨𝑉, 𝑎⟩ → (2nd𝑏) = (2nd ‘⟨𝑉, 𝑎⟩))
6463eqeq2d 2747 . . . . . . . . 9 (𝑏 = ⟨𝑉, 𝑎⟩ → (𝑎 = (2nd𝑏) ↔ 𝑎 = (2nd ‘⟨𝑉, 𝑎⟩)))
6564adantl 481 . . . . . . . 8 (((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) ∧ 𝑏 = ⟨𝑉, 𝑎⟩) → (𝑎 = (2nd𝑏) ↔ 𝑎 = (2nd ‘⟨𝑉, 𝑎⟩)))
66 op2ndg 8028 . . . . . . . . . . 11 ((𝑉𝑊𝑎 ∈ V) → (2nd ‘⟨𝑉, 𝑎⟩) = 𝑎)
6766elvd 3485 . . . . . . . . . 10 (𝑉𝑊 → (2nd ‘⟨𝑉, 𝑎⟩) = 𝑎)
6867adantl 481 . . . . . . . . 9 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → (2nd ‘⟨𝑉, 𝑎⟩) = 𝑎)
6968eqcomd 2742 . . . . . . . 8 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → 𝑎 = (2nd ‘⟨𝑉, 𝑎⟩))
7062, 65, 69rspcedvd 3623 . . . . . . 7 ((𝑎 ⊆ (Pairs‘𝑉) ∧ 𝑉𝑊) → ∃𝑏𝐺 𝑎 = (2nd𝑏))
7170ex 412 . . . . . 6 (𝑎 ⊆ (Pairs‘𝑉) → (𝑉𝑊 → ∃𝑏𝐺 𝑎 = (2nd𝑏)))
728, 71sylbi 217 . . . . 5 (𝑎𝑃 → (𝑉𝑊 → ∃𝑏𝐺 𝑎 = (2nd𝑏)))
7372impcom 407 . . . 4 ((𝑉𝑊𝑎𝑃) → ∃𝑏𝐺 𝑎 = (2nd𝑏))
741, 2, 3uspgrsprfv 48066 . . . . . . 7 (𝑏𝐺 → (𝐹𝑏) = (2nd𝑏))
7574adantl 481 . . . . . 6 (((𝑉𝑊𝑎𝑃) ∧ 𝑏𝐺) → (𝐹𝑏) = (2nd𝑏))
7675eqeq2d 2747 . . . . 5 (((𝑉𝑊𝑎𝑃) ∧ 𝑏𝐺) → (𝑎 = (𝐹𝑏) ↔ 𝑎 = (2nd𝑏)))
7776rexbidva 3176 . . . 4 ((𝑉𝑊𝑎𝑃) → (∃𝑏𝐺 𝑎 = (𝐹𝑏) ↔ ∃𝑏𝐺 𝑎 = (2nd𝑏)))
7873, 77mpbird 257 . . 3 ((𝑉𝑊𝑎𝑃) → ∃𝑏𝐺 𝑎 = (𝐹𝑏))
7978ralrimiva 3145 . 2 (𝑉𝑊 → ∀𝑎𝑃𝑏𝐺 𝑎 = (𝐹𝑏))
80 dffo3 7121 . 2 (𝐹:𝐺onto𝑃 ↔ (𝐹:𝐺𝑃 ∧ ∀𝑎𝑃𝑏𝐺 𝑎 = (𝐹𝑏)))
815, 79, 80sylanbrc 583 1 (𝑉𝑊𝐹:𝐺onto𝑃)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1539  wex 1778  wcel 2107  wral 3060  wrex 3069  {crab 3435  Vcvv 3479  cdif 3947  wss 3950  c0 4332  𝒫 cpw 4599  {csn 4625  cop 4631   class class class wbr 5142  {copab 5204  cmpt 5224   I cid 5576  dom cdm 5684  ran crn 5685  cres 5686  wf 6556  1-1wf1 6557  ontowfo 6558  1-1-ontowf1o 6559  cfv 6560  2nd c2nd 8014  cle 11297  2c2 12322  chash 14370  Vtxcvtx 29014  Edgcedg 29065  USPGraphcuspgr 29166  Pairscspr 47469
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756  ax-cnex 11212  ax-resscn 11213  ax-1cn 11214  ax-icn 11215  ax-addcl 11216  ax-addrcl 11217  ax-mulcl 11218  ax-mulrcl 11219  ax-mulcom 11220  ax-addass 11221  ax-mulass 11222  ax-distr 11223  ax-i2m1 11224  ax-1ne0 11225  ax-1rid 11226  ax-rnegex 11227  ax-rrecex 11228  ax-cnre 11229  ax-pre-lttri 11230  ax-pre-lttrn 11231  ax-pre-ltadd 11232  ax-pre-mulgt0 11233
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-int 4946  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-riota 7389  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-1st 8015  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-1o 8507  df-2o 8508  df-oadd 8511  df-er 8746  df-en 8987  df-dom 8988  df-sdom 8989  df-fin 8990  df-dju 9942  df-card 9980  df-pnf 11298  df-mnf 11299  df-xr 11300  df-ltxr 11301  df-le 11302  df-sub 11495  df-neg 11496  df-nn 12268  df-2 12330  df-n0 12529  df-xnn0 12602  df-z 12616  df-uz 12880  df-fz 13549  df-hash 14371  df-vtx 29016  df-iedg 29017  df-edg 29066  df-upgr 29100  df-uspgr 29168  df-spr 47470
This theorem is referenced by:  uspgrsprf1o  48070
  Copyright terms: Public domain W3C validator